Watermark-based code construction for finite-state Markov channel with synchronisation errors

With advancements in telecommunications, data transmission over increasingly harsher channels that produce synchronisation errors is inevitable. Coding schemes for such are available through techniques as the Davey-MacKay watermark coding; however, this limited to memoryless channel estimates. Memory must be accounted ensure a realistic approximation - similar Finite State Markov Chain or Fritchman Model. A novel code construction and three decoders developed correct while considering channel's correlated memory effects by incorporating ideas from scheme modelling. Simulation results show using stationary distribution values error probabilities proposed decoder viable solution, especially cases with low between errors. Further tests imply utilising entire transition matrix decoding process may better suited more significant The system prove helpful fields free-space optics possibly molecular communication, where harsh used communication.